Mathematical Programming Models for Influence Maximization on Social Networks
نویسنده
چکیده
Chen [2009] proposed the Target Set Selection (TSS) problem: • Given a connected undirected graph G = V; E . For each i ∈ V, there is a threshold, gi, which is between 1 and degree(i). All nodes are inactive initially. • Select a subset of nodes, the target set, and they become active immediately. • After that, in each step, an inactive node i becomes active if at least gi of its neighbors are active in the previous step. • Goal: Find the minimum target set while ensuring that all nodes are active at the end of this diffusion process.
منابع مشابه
A Supplier Selection Model for Social Responsible Supply Chain
Due to the importance of supplier selection issue in supply chain management (SCM) and ,also, the increasing tendency of organizations to their social responsibilities, In this paper, we survey the supplier selection issue as a multi objective problem while considering the factor of corporate social responsibility (CSR) as a mathematical parameter. The purpose of this paper is to design a mode...
متن کاملScalable Influence Maximization in Social Networks
Influence maximization is the problem of finding a small set of most influential nodes in a social network so that their aggregated influence in the network is maximized. In this paper, we study influence maximization in the linear threshold model, one of the important models formalizing the behavior of influence propagation in social networks. We first show that computing exact influence in ge...
متن کاملDynaDiffuse: A Dynamic Diffusion Model for Continuous Time Constrained Influence Maximization
Studying the spread of phenomena in social networks is critical but still not fully solved. Existing influence maximization models assume a static network, disregarding its evolution over time. We introduce the continuous time constrained influence maximization problem for dynamic diffusion networks, based on a novel diffusion model called DYNADIFFUSE. Although the problem is NP-hard, the influ...
متن کاملMaximizing Influence in Social Networks: A Two-Stage Stochastic Programming Approach That Exploits Submodularity
We consider stochastic influence maximization problems arising in social networks. In contrast to existing studies that involve greedy approximation algorithms with a 63% performance guarantee, our work focuses on solving the problem optimally. We propose a Benders decomposition algorithm to find the optimal solution to the problem with a finite number of samples. We show that the submodularity...
متن کاملTipTop: Exact Solutions for Influence Maximization in Billion-scale Networks
In this paper, we study the Cost-aware Target Viral Marketing (CTVM) problem, a generalization of Influence Maximization (IM), a well-known problem in viral marketing. CTVM asks for the most cost-effective users to influence the most relevant users. Instead of approximating the problem as done in the literature, we attempt to offer exact solutions. As the problem is in NP-hard, clearly the exac...
متن کامل